1 Implementations of Randomized Sorting on Large Parallel Machines ( Preliminary Version ) William L . Hightower Jan
نویسندگان
چکیده
Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a sophisticated randomized sampling technique to form a splitter set, but Samplesort distributes the splitter set to each processor while Flashsort uses splitter-directed routing. In this paper we present B-Flashsort, a new batched-routing variant of Flashsort designed to sort N>P values using P processors connected in a d-dimensional mesh and using constant space in addition to the input and output. The key advantage of the Flashsort approach over Samplesort is a decrease in memory requirements, by avoiding the broadcast of the splitter set to all processors. The practical advantage of B-Flashsort over Flashsort is that it replaces pipelined splitter-directed routing with a set of synchronous local communications and bounds recursion, while still being demonstrably efficient. The performance of B-Flashsort and Samplesort is compared using a parameterized analytic model in the style of [BLM+91] to show that on a d-dimensional toroidal mesh B-Flashsort improves on Samplesort when (N/P)ּ<Pּ/(c1log P +c2dP1/d +c3), for machine-dependent parameters c1, c2, and c3. Empirical confirmation of the analytical model is obtained through implementations on a MasPar MP-1 of Samplesort and two B-Flashsort variants. †Email: [email protected]. Supported in part by ONR contract N00014-89-J-1873 and by DARPA/ISTO contract N00014-91-C-0114. ‡Email: [email protected] . Supported in part by DARPA/ISTO contracts N00014-88-K-0458, N00014-91-J1985, and N00014-91-C-0114, and by NASA subcontract 55063 of prime contract NAS5-30428, and by US-Israel Binational NSF Grant 88-00282/2.
منابع مشابه
1 Implementations of Randomized Sorting on Large Parallel
Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a sophisticated randomized sampling technique to form a splitter set, but Samplesort distributes the splitter set to each processor while Flashsort uses splitter-directed routing. In this paper we present B-Flashsort, a new batched-routing variant of Flashsort designed to s...
متن کاملB-Flashsort: A High-performance Sort for the MasPar MP-1 and MP-2 Implementation Description
The sorting of large data sets is a key step in a great variety of applications such as query processing, polygon rendering, statistical analysis and optimization problems. While efficient sorting techniques and implementations have long been available for sequential computers, the problem remains a challenge for parallel computers. One reason is that efficient sequential algorithms take into a...
متن کاملA General-Purpose Parallel Sorting Algorithm
A parallel sorting algorithm is presented for general purpose internal sorting on MIMD machines. The algorithm initially sorts the elements within each node using a serial sorting algorithm, then proceeds with a two-phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm...
متن کاملFast Parallel Sorting under Logp : from Theory to Practice 3
1.1 ABSTRACT The LogP model characterizes the performance of modern parallel machines with a small set of parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P). In this paper, we analyze four parallel sorting algorithms (bitonic, column, radix, and sample sort) under LogP. We develop implementations of these algorithms in a parallel extension t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992